Bend-Minimum Orthogonal Drawings of Plane 3-Graphs
نویسندگان
چکیده
In an orthogonal drawing of a plane graph, any edge is drawn as a sequence of line segments, each having either a horizontal or a vertical direction. A bend is a point where an edge changes its direction. A drawing is called a bend-minimum orthogonal drawing if the number of bends is minimum among all orthogonal drawings. This paper presents a linear-time algorithm to find a bend-minimum orthogonal drawing of any given plane 3-graph, that is, a plane graph of maximum degree three.
منابع مشابه
Higher-Degree Orthogonal Graph Drawing with Flexibility Constraints
Much work on orthogonal graph drawing has focused on 4-planar graphs, that is planar graphs where all vertices have maximum degree 4. In this work, we study aspects of the Kandinsky model, which is a model for orthogonal graph drawings of higher-degree graphs. First, we examine the decision problem β-Embeddability, which asks whether for a given planar graph with a fixed or variable embedding, ...
متن کاملA Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
An orthogonal drawing of a plane graph G is a drawing of G in which each edge is drawn as a sequence of alternate horizontal and vertical line segments. In this paper we give a linear-time algorithm to find an orthogonal drawing of a given 3-connected cubic plane graph with the minimum number of bends. The best known algorithm takes time O(nT/4o~/I'd'~) for any plane graph of n vertices.
متن کاملNo-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs
A plane graph is a planar graph with a fixed embedding. In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing if at least one of its plane embeddings has a no-bend orthogonal drawing. In this paper we consider a class of planar graphs, c...
متن کاملBend-optimal orthogonal graph drawing in the general position model
We consider orthogonal drawings in the general position model, i.e., no two points share a coordinate. The drawings are also required to be bend minimal, i.e., each edge of a drawing in k dimensions has exactly one segment parallel to each coodinate direction that are glued together at k − 1 bends. We provide a precise description of the class of graphs that admit an orthogonal drawing in the g...
متن کاملTwo-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs
Some recent algorithms for 3-dimensional orthogonal graph drawing use no more than 3 bends per edge route. It is unknown if there exists a graph requiring a 3-bend edge route. In this paper we present an algorithm for 2-bend 3-dimensional orthogonal grid drawing of maximum degree 5 graphs. In addition 2-bend 3-dimensional grid drawings of the 6-regular multi-partite graphs are given.
متن کامل